Motion Planning for Multi-robot Coordination on Representation Space
نویسندگان
چکیده
The multi-robot coordination task is investigated in its Representation Space (RS). First, the RS model of the robot system as well as its prescribed task is formulated by clarifying the internal and external constraints affecting task realization. All constraints are depicted as unreachable areas in RS model. Then, whether a task is feasible or not is transformed to check 1) if the final representation denoting task realization of the robot system is reachable; and 2) if there is a connecting trajectory illustrating the process that the start representation varies to the final representation, amidst those unreachable areas denoting system constraints. Performance of different planning algorithms are also evaluated upon the representation space, from which the optimal planning algorithm could thus be recognized. The task of multi-robot formation navigation in a warehouse environment is exemplified to illustrate the performance of the proposed scheme: the formation of the robot system is maintained in motion with collisions avoided. Moreover, by incorporating the task oriented motion planning framework, it is capable of transforming an infeasible task into a feasible one with least adjustments in the system’s formation to adapt to inner and/or external constraints during task realization.
منابع مشابه
Computational Geometric Learning Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-Robot Motion Planning
We present a sampling-based framework for multirobot motion planning which incorporates an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs. Our pathfinding algorithm, discrete-RRT (dRRT), is an adaption of the celebrated RRT algorithm, for the discrete case of a graph. By rapidly exploring the high-dimensional configuration space repre...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملACS-PRM: Adaptive Cross Sampling Based Probabilistic Roadmap for Multi-robot Motion Planning
In this paper we present a novel approach for multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, we call ACSPRM, consists of three steps, which are C-space sampling, roadmap building and motion planning. Firstly, an adequate number of points should be generated in C-space on an occupancy grid map by using an adaptive...
متن کاملProbabilistic Road Map sampling strategies for multi-robot motion planning
This paper presents a Probabilistic Road Map (PRM) motion planning algorithm to be queried within Dynamic Robot Networks—a multi-robot coordination platform for robots operating with limited sensing and inter-robot communication. First, the Dynamic Robot Networks (DRN) coordination platform is introduced that facilitates centralized robot coordination across ad hoc networks, allowing safe navig...
متن کاملMotion Planning in Non-Gaussian Belief Spaces (M3P): The Case of a Kidnapped Robot
Planning under uncertainty is a key requirement for physical systems due to the noisy nature of actuators and sensors. Using a belief space approach, planning solutions tend to generate actions that result in information seeking behavior which reduce state uncertainty. While recent work has dealt with planning for Gaussian beliefs, for many cases, a multimodal belief is a more accurate represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014